Non-repetitive complexity of infinite words
نویسندگان
چکیده
The non-repetitive complexity function of an infinite word x (first defined by Moothathu) is the function of n that counts the number of distinct factors of length n that appear at the beginning of x prior to the first repetition of a length-n factor. We examine general properties of the non-repetitive complexity function, as well as obtain formulas for the non-repetitive complexity of the Thue-Morse word, the Fibonacci word and the Tribonacci word.
منابع مشابه
On Infinite Words Obtained by Selective Substitution Grammars
We present a method of generating infinite words from selective substitution grammars introduced by Rozenberg (1977). Comparison is made with some of the well-known limiting processes and limit language families and certain closure properties are examined. A technique is given for obtaining infinite non-repetitive words. Several decidability results are established.
متن کاملFactor complexity of infinite words associated with non-simple Parry numbers
The factor complexity of the infinite word uβ canonically associated to a non-simple Parry number β is studied. Our approach is based on the notion of special factors introduced by Berstel and Cassaigne. At first, we give a handy method for determining infinite left special branches; this method is applicable to a broad class of infinite words which are fixed points of a primitive substitution....
متن کاملAvoiding and Enforcing Repetitive Structures in Words
The focus of this thesis is on the study of repetitive structures in words, a central topic in the area of combinatorics on words. The results presented in the thesis at hand are meant to extend and enrich the existing theory concerning the appearance and absence of such structures. In the first part we examine whether these structures necessarily appear in infinite words over a finite alphabet...
متن کاملRecurrent Partial Words and Representable Sets
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be total words (or simply words). Given an infinite partial word w, the number of distinct total words over the alphabet that are compatible with factors of w of a given length, called subwords of w, refers to...
متن کاملPalindromic complexity of infinite words associated with non-simple Parry numbers
We study the palindromic complexity of infinite words uβ , the fixed points of the substitution over a binary alphabet, φ(0) = 01, φ(1) = 01, with a − 1 ≥ b ≥ 1, which are canonically associated with quadratic non-simple Parry numbers β. 1991 Mathematics Subject Classification. 68R15, 11A63 .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1507.08206 شماره
صفحات -
تاریخ انتشار 2015